Graph / Hamiltonian path (Bibtex)

P418: Enumeration of all Hamiltonian paths in a graph
Input:
A graph $G$.
Output:
All Hamiltonian paths in $G$.
Complexity:
Comment:
Reference:
[Yau1967] (Bibtex)